Convergence of positive linear approximation processes
نویسندگان
چکیده
منابع مشابه
Fast Approximation Algorithms for Positive Linear Programs
Fast Approximation Algorithms for Positive Linear Programs by Di Wang Doctor of Philosophy in Computer Science University of California, Berkeley Professor Satish Rao, Chair Positive linear programs (LPs), or equivalently, mixed packing and covering LPs, are LPs formulated with non-negative coefficients, constants, and variables. Notable special cases of positive LPs include packing LPs and cov...
متن کاملUniform weighted approximation by positive linear operators
We characterize the functions defined on a weighted space, which are uniformly approximated by a sequence of positive linear operators and we obtain the range of the weights which can be used for uniform approximation. We, also, obtain an estimation of the remainder in terms of the usual modulus of continuity. We give particular results for the Szász-Mirakjan and Baskakov operators. Mathematics...
متن کاملPositive Linear Programming, Parallel Approximation and PCP's
Several sequential approximation algorithms are based on the following paradigm: solve a linear or semideenite programming relaxation , then use randomized rounding to convert fractional solutions of the relaxation into integer solutions for the original combinatorial problem. We demonstrate that such a paradigm can also yield parallel approximation algorithms by showing how to convert certain ...
متن کاملLinear Convergence in the Approximation of Rank-one Convex Envelopes
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope f of a given function f : Rn×m → R, i.e. the largest function below f which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington. Mathematics Subject Classification. 65K10, 74G15, 74G65, 74N99. Received: May 27...
متن کاملOn the convergence of linear stochastic approximation procedures
Many stochastic approximation procedures result in a stochastic algorithm of the form 1 hk+l = h k + (bk A k h k ) , k for all IC = 1 , 2 , 3 . . . . . Here, { b k , IC = 1,2 ,3 , . . .} is a Rd-valued process, { Ak , IC = 1 , 2 . 3 . . . . } is a symmetric, positive semidefinite Redxd-valued process, and { h k k = 1,2 ,3 , . .} is a sequence of stochastic estimates which hopefully converges to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tohoku Mathematical Journal
سال: 1983
ISSN: 0040-8735
DOI: 10.2748/tmj/1178229002